Compact symmetric spaces, triangular factorization, and Cayley coordinates
نویسندگان
چکیده
منابع مشابه
Compact symmetric spaces , triangular factorization , and Cayley coordinates Derek Habermas
Let U/K represent a connected, compact symmetric space, where θ is an involution of U that fixes K, φ : U/K → U is the geodesic Cartan embedding, and G is the complexification of U. We investigate the intersection, studied by Pickrell, of φ(U/K) with the Birkhoff decomposition of G corresponding to a θ-stable triangular, or LDU, factoriztion of Lie(G). When g ∈ φ(U/K) is generic, the factorizat...
متن کاملCompact Symmetric Spaces, Triangular Factorization, and Poisson Geometry
LetX be a simply connected compact Riemannian symmetric space, let U be the universal covering group of the identity component of the isometry group of X , and let g denote the complexification of the Lie algebra of U , g = u. Each u-compatible triangular decomposition g = n − + h + n+ determines a Poisson Lie group structure πU on U . The Evens-Lu construction ([EL]) produces a (U, πU )-homoge...
متن کاملCompact Weakly Symmetric Spaces and Spherical Pairs
Let (G,H) be a spherical pair and assume that G is a connected compact simple Lie group and H a closed subgroup of G. We prove in this paper that the homogeneous manifold G/H is weakly symmetric with respect to G and possibly an additional fixed isometry μ. It follows that M. Krämer’s classification list of such spherical pairs also becomes a classification list of compact weakly symmetric spac...
متن کاملSymmetric indefinite triangular factorization revealing the rank profile matrix
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization PAP = LDL where P is a permutation matrix, L is lower triangular with a unit diagonal and D is symmetric block diagonal with 1×1 and 2×2 antidiagonal blocks. The novel algorithm requires O(n2rω−2) arithmetic o...
متن کاملComputing Symmetric Rank-Revealing Decompositions via Triangular Factorization
We present a family of algorithms for computing symmetric rank-revealing VSV decompositions, based on triangular factorization of the matrix. The VSV decomposition consists of a middle symmetric matrix that reveals the numerical rank in having three blocks with small norm, plus an orthogonalmatrix whose columns span approximations to the numerical range and null space. We show that for semi-de ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2011
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.2011.253.57